EventQueue

High efficient(at least memory-wise), tightly packed Input queue that supports any kind of data in a single allocated memory pool(no fragmentation).

This class could probably be extendeded to be every event handler

class EventQueue {

import hip.util.memory;;

void* eventQueue;

uint bytesCapacity;

uint bytesOffset;

protected @nogc

uint pollCursor;

this(uint capacity);

void post(ubyte type, T ev);

void clear();

Event* poll();

}

Constructors

this this(uint capacity): Undocumented in source.

Destructor

~this ~this(): Undocumented in source.

Members

Functions

clear void clear(): Undocumented in source. Be warned that the author may not have intended to support it.
poll Event* poll(): Undocumented in source. Be warned that the author may not have intended to support it.
post void post(ubyte type, T ev): Undocumented in source. Be warned that the author may not have intended to support it.

Structs

Event struct Event: Undocumented in source.

Variables

bytesCapacity uint bytesCapacity;: BytesOffset should never be greater than capacity
bytesOffset uint bytesOffset;: Undocumented in source.
eventQueue void* eventQueue;: Linearly allocated variable length Events
pollCursor uint pollCursor;: Undocumented in source.

Meta

Source

See Implementation

hip util data_structures aliases

AArray

classes

mixin templates

DirtyFlagFields

structs